Secret sharing schemes for graph-based prohibited structures
نویسندگان
چکیده
منابع مشابه
Secret Sharing Schemes for Graph-Based Prohibited Structures
K e y w o r d s C r y p t o g r a p h y , Data security, Information theory, Secret sharing scheme. 1 . I N T R O D U C T I O N In 1987, I to et al. [1] desc r ibed a genera l m e t h o d of secret shar ing cal led Secret Sharing Scheme (SSS) which allows a m a s t e r key to be sha red among a finite set of p a r t i c i p a n t s in such a way t h a t on ly ce r ta in prespecif ied subse ts o...
متن کاملSecret Sharing in Graph-Based Prohibited Structures
A secret sharing scheme for the prohibited structure is a method of sharing a master key among a finite set of participants in such a way that only certain pre-specified subsets of participants cannot recover the master key. A secret sharing scheme is called perfect if any subset of participants who cannot recover the master key obtains no information regarding the master key. In this paper, we...
متن کاملLinear Secret-Sharing Schemes for Forbidden Graph Access Structures
A secret-sharing scheme realizes the forbidden graph access structure determined by a graph G = (V,E) if a pair of vertices can reconstruct the secret if and only if it is an edge in G. Secret-sharing schemes for forbidden graph access structures of bipartite graphs are equivalent to conditional disclosure of secrets protocols, a primitive that is used to construct attributed-based encryption s...
متن کاملOn Multiplicative Secret Sharing Schemes Realizing Graph Access Structures
In this paper we consider graph access structures and we show that such an access structure can be realized by a (strongly) multiplicative monotone span program if and only if the privacy structure contains at least three (resp. four) maximal sets. Thus, we obtain a new family of access structures with an explicit construction that is both ideal and strongly multiplicative. Until now only three...
متن کاملSecret sharing schemes for Multipartite access structures
Information security has become much more important since electronic communication is started to be used in our daily life. The content of the term information security varies according to the type and the requirements of the area. Secret sharing schemes are introduced to solve the problems for securing sensitive information. In this paper, we review our proposed hierarchical and compartmented ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 1998
ISSN: 0898-1221
DOI: 10.1016/s0898-1221(98)00177-1